Skip to main content

FindSpanningTree

FindSpanningTree[{v1,v2,…,vn}] finds a spanning tree that minimizes the total distance between the vi.

FindSpanningTree[g] finds a spanning tree of the graph g that minimizes the total distances between vertices.

FindSpanningTree[{g,v},…] finds a spanning tree of the connected component of g that includes the vertex v. 

FindSpanningTree[{v->w,…},…] uses rules v->w to specify the graph g.

Please visit the official Wolfram Language Reference for more details and examples on core symbols.